Random Graph Isomorphism
نویسندگان
چکیده
Abstract. A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i .e. all but o(2 (2 >) of the 2 t 1 graphs on n vertices) . Hence, for almost all graphs X, any graph Y can be easily tested for isomorphism to X by an extremely naive linear time algorithm . This result is based on the following : In almost all graphs on n vertices, the largest n 0 .15 degrees are distinct . In fact, they are pairwise at least n0 .03 apart .
منابع مشابه
Improved random graph isomorphism
Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem. We give a simple, linear time, high probability algorithm for the canonical labeling of a G(n, p) random graph for p ∈ [ ω ( ln n/n ln lnn ) , 1− ω ( ln n/n ln lnn )] . Our result covers a gap ...
متن کاملFinding induced subgraphs in scale-free inhomogeneous random graphs
We study the induced subgraph isomorphism problem on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that determines for any connected graph H on k vertices if it exists as induced subgraph in a random graph with n vertices. By exploiting the scale-free graph structure, the algorithm runs in O(ne 4 ) time, and finds for constant k an instance of...
متن کاملLinear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space isometry problem over a finite field in time polynomial in the underlying vector space size. We propose a venue of attack for the latter problem by viewing it as ...
متن کاملParallel Subgraph Isomorphism
The subgraph isomorphism problem deals with determining whether a given graph H is isomorphic to some subgraph of another graph G. In this paper we attempt to parallelize a fast serial subgraph isomorphism library, VFLib, which uses backtracking search to find a solution. Our parallel solution runs on Cilk++ for efficient execution on multicore machines. In our work we examine the benefits and ...
متن کاملNew Invariants for the Graph Isomorphism Problem
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other wellknown methods could not compute (such as special Fürer Gadgets and point-line incidence graphs of finite projective planes of higher d...
متن کاملFast Isomorphism Testing of Graphs with Regularly-Connected Components
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This algorithm is an improved version of the algorithm conauto, which has been shown to be very fast for random graphs and several families of hard graphs [9]. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 9 شماره
صفحات -
تاریخ انتشار 1980